Longest Bitonic Subsequence #266
                
     Open
            
            
          
  Add this suggestion to a batch that can be applied as a single commit.
  This suggestion is invalid because no changes were made to the code.
  Suggestions cannot be applied while the pull request is closed.
  Suggestions cannot be applied while viewing a subset of changes.
  Only one suggestion per line can be applied in a batch.
  Add this suggestion to a batch that can be applied as a single commit.
  Applying suggestions on deleted lines is not supported.
  You must change the existing code in this line in order to create a valid suggestion.
  Outdated suggestions cannot be applied.
  This suggestion has been applied or marked resolved.
  Suggestions cannot be applied from pending reviews.
  Suggestions cannot be applied on multi-line comments.
  Suggestions cannot be applied while the pull request is queued to merge.
  Suggestion cannot be applied right now. Please check back later.
  
    
  
    
ISSUE NUMBER
#265
SHORT DESCRIPTION
Code to find the longest bitonic subsequence in C++ using dynamic programming.
TESTING
Some inputs with their correct outputs.
Input:-
8
1 11 2 10 4 5 2 1
Output:-
6
Input:-
6
12 11 40 5 3 1
Output:-
5